WORST_CASE(?,O(n^1))
* Step 1: Ara WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            anyEq(nr,ConsNat(x,xs)) -> ite(eq(nr,x),True(),anyEq(nr,xs))
            anyEq(nr,NilNat()) -> False()
            lookup(nr,Leaf(xs)) -> anyEq(nr,xs)
            lookup(nr,Node(ConsNat(up,nrs),ConsBTree(t,ts))) -> ite(leq(nr,up),lookup(nr,t),lookup(nr,Node(nrs,ts)))
            lookup(nr,Node(NilNat(),ConsBTree(tGt,NilBTree()))) -> lookup(nr,tGt)
        - Weak TRS:
            eq(0(),0()) -> True()
            eq(0(),S(m)) -> False()
            eq(S(n),0()) -> False()
            eq(S(n),S(m)) -> eq(n,m)
            ite(False(),t,e) -> e
            ite(True(),t,e) -> t
            leq(0(),0()) -> True()
            leq(0(),S(m)) -> True()
            leq(S(n),0()) -> False()
            leq(S(n),S(m)) -> leq(n,m)
        - Signature:
            {anyEq/2,eq/2,ite/3,leq/2,lookup/2} / {0/0,ConsBTree/2,ConsNat/2,False/0,Leaf/1,NilBTree/0,NilNat/0,Node/2
            ,S/1,True/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {anyEq,eq,ite,leq,lookup} and constructors {0,ConsBTree
            ,ConsNat,False,Leaf,NilBTree,NilNat,Node,S,True}
    + Applied Processor:
        Ara {araHeuristics = NoHeuristics, minDegree = 1, maxDegree = 2, araTimeout = 5, araRuleShifting = Nothing}
    + Details:
        Signatures used:
        ----------------
          0 :: [] -(0)-> "A"(0)
          0 :: [] -(0)-> "A"(15)
          ConsBTree :: ["A"(15) x "A"(15)] -(15)-> "A"(15)
          ConsNat :: ["A"(15) x "A"(15)] -(15)-> "A"(15)
          ConsNat :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
          False :: [] -(0)-> "A"(0)
          False :: [] -(0)-> "A"(15)
          False :: [] -(0)-> "A"(13)
          Leaf :: ["A"(15)] -(15)-> "A"(15)
          NilBTree :: [] -(0)-> "A"(15)
          NilNat :: [] -(0)-> "A"(15)
          NilNat :: [] -(0)-> "A"(0)
          Node :: ["A"(0) x "A"(15)] -(0)-> "A"(15)
          S :: ["A"(15)] -(15)-> "A"(15)
          S :: ["A"(0)] -(0)-> "A"(0)
          True :: [] -(0)-> "A"(0)
          True :: [] -(0)-> "A"(15)
          True :: [] -(0)-> "A"(13)
          anyEq :: ["A"(0) x "A"(15)] -(7)-> "A"(14)
          eq :: ["A"(0) x "A"(15)] -(1)-> "A"(11)
          ite :: ["A"(0) x "A"(14) x "A"(14)] -(1)-> "A"(14)
          leq :: ["A"(0) x "A"(0)] -(0)-> "A"(11)
          lookup :: ["A"(0) x "A"(15)] -(1)-> "A"(14)
        
        
        Cost-free Signatures used:
        --------------------------
        
        
        
        Base Constructor Signatures used:
        ---------------------------------
          "0_A" :: [] -(0)-> "A"(1)
          "ConsBTree_A" :: ["A"(1) x "A"(1)] -(1)-> "A"(1)
          "ConsNat_A" :: ["A"(1) x "A"(1)] -(1)-> "A"(1)
          "False_A" :: [] -(0)-> "A"(1)
          "Leaf_A" :: ["A"(1)] -(1)-> "A"(1)
          "NilBTree_A" :: [] -(0)-> "A"(1)
          "NilNat_A" :: [] -(0)-> "A"(1)
          "Node_A" :: ["A"(0) x "A"(1)] -(0)-> "A"(1)
          "S_A" :: ["A"(1)] -(1)-> "A"(1)
          "True_A" :: [] -(0)-> "A"(1)
        

WORST_CASE(?,O(n^1))